Re-identifying Anonymous Nodes

نویسندگان

  • Stefan Schlott
  • Frank Kargl
  • Michael Weber
چکیده

In mobile scenarios, privacy is an aspect of growing importance. In order to avoid the creation of movement profiles, participating nodes change their identifying properties on a regular basis in order to hide their identities and stay anonymous. The drawback of this action is that nodes which previously had a connection have no means to recognise this fact. A complete re-authentication would be necessary – if possible at all. This paper discusses this new problem and proposes two possible solutions for re-identification of anonymous nodes, one based on symmetric encryption and one based on secure hashes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rethinking $(k,\ell)$-anonymity in social graphs: $(k,\ell)$-adjacency anonymity and $(k,\ell)$-(adjacency) anonymous transformations

This paper treats the privacy-preserving publication of social graphs in the presence of active adversaries, that is, adversaries with the ability to introduce sybil nodes in the graph prior to publication and leverage them to create unique fingerprints for a set of victim nodes and re-identify them after publication. Stemming from the notion of (k, l)-anonymity, we introduce (k, l)-anonymous t...

متن کامل

Betrayed By My Shadow: Learning Data Identity via Trail Matching

The term “re-identification” refers to the correct relation of seemingly anonymous data to explicitly identifying information, such as the name or address, of people who are the subjects of the data. Historically, methods for re-identification have been based on data released from a single data holder. This paper extends the concept to trail re-identification in which a person is related to see...

متن کامل

A Resilient P2P Anonymous Routing Approach Employing Collaboration Scheme

Node churn is a hindrance to construction of P2P-based anonymous networks, which makes anonymous paths fragile and results in message losses and communication failures. A collaboration scheme combining Friendly Neighbor-based Incentive (FNI) and Re-encryption mechanism is proposed to deal with the high node churn characteristic of P2P networks. The FNI mechanism encourages peers to forward othe...

متن کامل

Trail Re-Identification: Learning Who You Are From Where You Have Been

This paper provides algorithms for learning the identities of individuals from the trails of seemingly anonymous information they leave behind. Consider online consumers, who have the IP addresses of their computers logged at each website visited. Many falsely believe they cannot be identified. The term “reidentification” refers to correctly relating seemingly anonymous data to explicitly ident...

متن کامل

Traffic Analysis Attacks and Defenses in Low Latency Anonymous Communication

Traffic Analysis Attacks and Defenses in Low Latency Anonymous Communication Sambuddho Chakravarty The recent public disclosure of mass surveillance of electronic communication, involving powerful government authorities, has drawn the public’s attention to issues regarding Internet privacy. For almost a decade now, there have been several research efforts towards designing and deploying open so...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006